Resilient data communications with physical layer link aggregation, extended failure detection and load balancing

ABSTRACT

Rapid channel failure detection and recovery in wireless communication networks is needed in order to meet, among other things, carrier class Ethernet channel standards. Thus, resilient wireless packet communications is provided using a physical layer link aggregation protocol with a hardware-assisted rapid channel failure detection algorithm and load balancing, preferably in combination. This functionality may be implemented in a Gigabit Ethernet data access card with an engine configured accordingly. In networks with various topologies, these features may be provided in combination with their existing protocols.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S.Nonprovisional patent application Ser. No. 14/281,746, filed May 19,2014 and entitled “Resilient Data Communications with Physical LayerLink Aggregation, Extended Failure Detection and Load Balancing,” nowU.S. Pat. No. 9,294,943, which is a continuation of and claims priorityto U.S. Nonprovisional patent application Ser. No. 13/305,703, filedNov. 28, 2011 and entitled “Resilient Data Communications with PhysicalLayer Link Aggregation, Extended Failure Detection and Load Balancing,”now U.S. Pat. No. 8,774,000, which is a continuation of and claimspriority to U.S. Nonprovisional patent application Ser. No. 12/205,791,filed Sep. 5, 2008 and entitled “Resilient Data Communications withPhysical Layer Link Aggregation, Extended Failure Detection and LoadBalancing,” now U.S. Pat. No. 8,264,953, which claims priority to U.S.Provisional Patent Application Ser. No. 60/970,476, filed Sep. 6, 2007and entitled “Resilient Data Communications with Physical Layer LinkAggregation, Extended Failure Detection and Load Balancing,” which arehereby incorporated by reference herein.

FIELD OF THE TECHNOLOGY

The technology relates to data communications and more particularly toresilient data communications in networks such as wireless datacommunication networks.

BACKGROUND

The requirements of extended capacity and increased reliabilityassociated with data communication environments that allow convergenceof voice, data and video, as well as storage on IP networks has createda need for carrier-class availability. Carrier-class infrastructure,also known as “carrier grade” infrastructure, is considered a relativelyreliable network hardware and software infrastructure. Enterprises suchas mobile wireless carriers, data access providers, and fixed wirelesscarriers, as well as enterprises and government institutions thatoperate broadband wireless networks often use carrier-classinfrastructure for handling their IP communications and mission criticalapplications. For example, to carry voice traffic and real-time trafficin converged environments, a carrier-class network infrastructure may beconfigured to deliver the same level of availability as the publicswitched telephone network. Thus, in establishing a carrier-classinfrastructure, the communications network can be deployed with topologydesigned to suit the needs of the particular enterprise.

A network topology is the pattern of links between nodes where a givennode has one or more links to other nodes in the network. Physicaltopologies of networks include examples such as ring, mesh and bus. Alogical topology is the nature of the paths that signals follow fromnode to node, and, in many instances, the logical and physicaltopologies are similar.

For increased bandwidth, load balancing and availability ofcommunication channels between nodes (e.g., switches and stations), linkaggregation or trunking, according to IEEE standard 802.3ad, is a methodof grouping physical network links into a single logical link. With linkaggregation, it is possible to increase capacity of communicationchannels between nodes using their Fast Ethernet and Gigabit Ethernettechnology. Two or more Gigabit Ethernet connections can be grouped toincrease bandwidth, and to create resilient and redundant links.Standard local area network (LAN) technology provides data rates of 10Mbps, 100 Mbps and 1000 Mbps and, for obtaining higher capacity (e.g.,10,000 Mbps) link aggregation allows grouping of 10 links. Where factorsof ten (10) are excessive, link aggregation can provide intermediaterates by grouping links with different rates.

Wired network protocols are designed to meet the Ethernet set ofrequirements and aim to improve scalability, bandwidth allocation andthroughput in order to meet the demands of packet-switched networks. Atypical Ethernet physical layer interface presently meets 1 Gbps to 10Gbps rates. In the event of fiber or node failure, recovery may need tosatisfy 50 milliseconds recovery time.

Current carrier class infrastructure requirements deal with quality ofservice (QoS), resiliency, reliability, load balancing, response timeand manageability of the communications network. Standards establishingthese requirements are designed for QoS at a particular level. However,providing load balancing at layer-2 or layer-3, for instance, isdifficult because it depends on upper-layer features of the traffic.Additionally, the recovery time during which a system folds back into avalid configuration takes too long, creating a convergence problem.

SUMMARY

The foregoing configurations and protocols may not be optimized forfeatureless load balancing among carriers and for wirelesscommunications. Existing configurations further require excessiveoverhead, do not incorporate resilience at the physical layer andprovide a slow failure detection and recovery response. For example, ina LAN or other type of network, a layer-2 link aggregation looks at MAC(media access control) addresses of the source and destination. Inparticular, a layer-2 link aggregation finds a link aggregation groupnumber for each Ethernet frame transported through the network byperforming a XOR computation on the least significant bytes (LSBytes) ofthe source and destination MAC addresses. The XOR computation produces akey that determines the link aggregation group to which an Ethernetframe belongs (i.e., frame membership).

In some embodiments in a physical layer link aggregation, there is agroup in which members are physical links but there are no keys.Accordingly, various embodiments that implement this featureless,layer-1 approach provide resilient packet communications with theapplication of a physical layer link aggregation protocol, extendedfailure detection algorithm, load balancing, or any combination thereof.Preferably, all three are applied.

Resilient wireless packet networks with link aggregation may providewireless operations with error resiliency and limited or minimal impacton throughput. However, optimization of such networks for physical layertraffic with featureless load balancing is exclusive of the layer-2traffic-features-based optimization and, thereby, reduces bandwidthusage attributed to overhead. In other words, featureless load balancingat the physical layer of a multi-carrier resilient packet network isindependent from layer-2 traffic features, and allows fast detection andautomatic failure recovery.

Point-to-point wireless link aggregation topologies are a typicalapplication for the resilient physical layer link aggregation. Thisallows deployment of wireless data communication networks withresiliency to failures through robust and fast failure detection andrecovery. These embodiments may be capable of lower than 50 ms wirelesslink failure detection rate, per link, and below-50 ms wireless linkhealing (recovery) rate in a multi-carrier network topology. Amulti-carrier wireless network can exhibit a unilateral and reliableend-to-end resiliency to failures through such robust and fast failuredetection and recovery. It can further provide carrier class protectionperformance to wireless networks.

Resilient wireless packet networks, for example, are implemented usingan improved Gigabit Ethernet card with functionality designed forproviding these benefits. And, although this solution is capable ofbeing implemented using external equipment such as routing devices, theimproved Gigabit Ethernet card implementation is preferred because thedetection and recovery signals are available locally and no additionaloverhead is needed. In other words, the improved Gigabit Ethernet cardimplementation is preferred because it provides better results with lessimpact on the throughput.

Hence, various embodiments of systems and methods can be provided forproviding the desired resilient packet communications in a network. Oneexemplary method may comprise: instantiating a rapid channel failuredetection algorithm, instantiating a physical layer link aggregationprotocol associated with links of a network for packet communications,and combining the physical layer link aggregation protocol with therapid channel failure detection algorithm. The combination is responsiveto failures in the network and provides for automatic failure recoveryof the network in order to render communications of packets through thenetwork resilient to such failures.

Another method for resilient packet communications in a network maycomprise instantiating a physical layer link aggregation protocol andinstantiating a rapid channel failure detection algorithm that isoperative to cooperate with the physical layer link aggregation protocolin performing, on a per-link basis, failure detection and recoverysteps. The steps may include obtaining status indication containingreceive status or transmit status, determining if packet trafficalignment is locked and, if not, setting the receive status to bad,determining if a packet was received, and, if not, determining if thereceive status should be set to bad, computing a validity value of apacket header field that contains receive status to determine if thepacket header field is valid and the receive status should be set togood, determining the transmit status from the receive status of apacket, if received, and initiating automatic failure or error recoveryof the network if the transmit status and/or receive status are bad.

One exemplary system for resilient wireless packet communications maycomprise: means for instantiating a rapid channel failure detectionalgorithm, means for instantiating a physical layer link aggregationprotocol associated with links of a network for packet communications,and means for combining the physical layer link aggregation protocolwith the rapid channel failure detection algorithm. Such combination isresponsive to failures in the network and provides for the automaticfailure recovery of the network in order to render communications ofpackets through the network resilient to such failures.

Another system for resilient wireless packet communications in anetwork, may comprise: a plurality of nodes interconnected in a networkvia links, each node having a data access card operative to execute aphysical layer link aggregation protocol and a rapid wireless channelfailure detection algorithm, and a plurality of customer data accessports for connections of the plurality of nodes to the network. Then, inorder to render communications of packets through the network resilientto failures, the physical layer link aggregation protocol and the rapidchannel failure detection algorithm are operative to cooperate with eachother and to enable automatic failure recovery of the network inresponse to failures.

In implementing the foregoing embodiments, various system and/or methodaspects may be included. These aspects may relate directly or indirectlyto the physical layer link aggregation protocol, rapid channel failuredetection algorithm and load balancing.

For instance, the physical layer link aggregation protocol typicallyincludes creating the link aggregation group by logically grouping linksto operate, in combination, as a single virtual link in order toincrease capacity. The rapid channel failure detection algorithm ispreferably extended from failure status detection of all the links in alink aggregation group to per-link failure status detection. Theper-link failure status detection provides individual end-to-end statusfor each link in the network involved in the physical layer linkaggregation protocol. Thus, unless all links that participate in thelink aggregation group have failed, the link aggregation group maintainsa ‘good’ status condition, all-be-it at a reduced capacity, and when anyof the failed links recovers the capacity increases accordingly. Thefailure recovery includes prompting the physical layer link aggregationprotocol to redistribute packet traffic flow to link aggregation groupmembers that remain in ‘good’ condition and restore traffic flow tolinks that recover to ‘good’ condition and rejoin the link aggregationgroup. Also, the rapid channel failure detection algorithm is autonomousin the detection of failures in that it is independent from othernetwork system failure indications, and it is agnostic to the number ofhops required for transporting payloads through the network. The trafficflow is preferably restored to any failed link aggregation member oncethe failure condition associated with it disappears. Thus, the physicallayer link aggregation protocol is dynamic. Moreover, because of thelayer-1 implementation, the physical layer link aggregation protocol isfeatureless (e.g., independent of MAC or IP address).

The physical layer link aggregation protocol and rapid channel failuredetection algorithm are preferably implemented in a data access card toeffect configuration of ports that are associated with the data accesscard, including selection of port aggregates to create logical groupingsof ports. The data access card preferably includes an engine forperforming functions associated with the combined physical layer linkaggregation protocol and rapid channel failure detection algorithm. Theengine can be implemented in a logic circuit, an FPGA (fieldprogrammable gate array) or an ASIC (application specific integratedcircuit).

Preferably also, the physical layer link aggregation protocol isimplemented to operate with load balancing, wherein, for load balancing,each frame, or each group of frames, is segmented and associated with aparticular link aggregation group. For instance, the segmentation isperformed uniformly, on a boundary of a byte, word or frame, based oncapacity or speed of links is the link aggregation group, or anycombination thereof. For each segmentation performed on a frame or groupof frames a reassembly is correspondingly performed to reconstruct suchframe or group of frames. Each segmentation and its correspondingreassembly are configured for similar boundaries. Moreover, Each linkhas transmit and receive ends, and when segmentation is applied at thetransmit end its corresponding reassembly is applied at the receive endin order to maintain substantial alignment of traffic flow at thetransmit and receive ends. The transmit and receive ends cooperate tohandle frames or groups of frames, serially, in parallel or ininterleaved mode.

In implementing the various embodiments, the network may be a wirelesscommunications network. In such cases, the network includes wirelesslinks between a plurality of nodes, and each node has a transmit statusand a receive status associated therewith. The transmit status at aparticular node is a reflection of the receive status at another,far-end node that is wirelessly linked to that particular node.

In a typical implementation, the rapid channel failure detectionalgorithm formats packets with an extended header field that containsreceive status information and a header integrity field. The headerintegrity field contains and indicia of integrity such as a calculatedchecksum (CRC). The reflection of the receive status from which thetransmit status is derived is obtained from the receive status ofpackets received from a far end node, wherein failure in a particularnode is determined based on whether its associated receive and/ortransmit status are bad. The rapid channel failure detection algorithmmay be independent from the presence of payload in packets transportedthrough the network, and in the absence of payload it inserts keep-alivepackets to maintain link status. The rapid channel failure detectionalgorithm inserts the keep-alive packets at a predetermined rate basedon network traffic load. The rapid channel failure detection algorithmis operative to provide wireless operations with error resiliency, andwherein the number of possible successive error packets is adjusted tofilter out error bursts including fewer than a predetermined number ofsuch packets. The rapid channel failure detection algorithm determines a‘good’ transmit or receive status upon detecting a predetermined numberof successive packets with valid integrity an indicia of which is thecalculated checksum (CRC).

As described above, the rapid channel failure detection algorithm ispreferably hardware-assisted and operative to provide network end-to-endfailure detection and recovery. The rapid channel failure detectionalgorithm discovers a failure in either direction, transmit or receive,independently, and a failure in one direction does not prevent trafficflow in the opposite direction. The rapid channel failure detectionalgorithm determines the presence of a failure condition when there isone or more of a traffic alignment error, a packet exceeds a timeout anda packet integrity error threshold is exceeded. The rapid channelfailure detection algorithm continues to operate in the presence offailures and errors once detected.

In sum, various embodiments provide resilient packet communicationsusing a physical layer link aggregation, extended rapid channel failuredetection and load balancing, as illustrated herein. These and otherfeatures, aspects and advantages of various embodiments will becomebetter understood from the description herein, appended claims, andaccompanying drawings as hereafter described.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute apart of this specification illustrate various aspects of the variousembodiments and together with the description, serve to explain theprinciples associated therewith. Wherever convenient, the same referencenumbers will be used throughout the drawings to refer to the same orlike elements.

FIG. 1 is block diagram of an existing Gigabit Ethernet data access card(DAC).

FIG. 2A is a block diagram showing the overhead used in a processingengine within an existing DAC.

FIG. 2B is state diagram showing keep-alive message insertion.

FIG. 3A illustrates the user interface of a physical layer linkaggregation configuration program.

FIG. 3B is a diagram showing link redundancy configuration with physicallayer link aggregation.

FIG. 4 is a block diagram illustrating an FPGA (field programmable gatearray)-based implementation for rapid channel failure detection (RCFD)in a DAC-GE.

FIG. 5, illustrates an enhanced Ethernet packet encapsulation for RCFD.

FIG. 6 illustrates packet traffic alignment.

FIG. 7 illustrates disassembly and construction of Ethernet data streamtraversing the two radio channels in a DAC-GE and two RACs.

FIG. 8 is a wireless network configured for physical layer linkaggregation with a modified Gigabit Ethernet data access card (DAC-GE).

FIG. 9 is a diagram of a multi-node wireless network configuration witha DAC-GE for physical layer link aggregation.

FIG. 10, is a block diagram of a physical layer link aggregation withthe FPGA in a DAC-GE feeding a pair of ODUs via a TDM bus.

FIG. 11 is a link aggregation payload redistribution state diagram.

FIG. 12 is a block diagram of a carrier link portion of the FPGA in aDAC-GE; the figure illustrates the insertion and extraction of theoverhead information that is ultimately used for rapid failure detectionfor each virtual container.

FIG. 13 is a flow diagram of a method for rapid channel failuredetection and recovery.

DETAILED DESCRIPTION

The following description is provided in the context of this Applicationand its requirements to enable a person of ordinary skill in the art tomake and use the claimed invention. Various modifications to theembodiments described and shown are possible and various genericprinciples defined herein may be applied to these and other embodiments.Thus, the claimed invention is to be accorded the widest scopeconsistent with the principles, features and teachings disclosed herein.

Generally, various embodiments relate to data communications in networkssuch as wireless communications networks with carrier-classinfrastructure. To improve their performance, such networks may rely onresilient wireless communication techniques. This applies, for instance,to extended capacity, redundancy, load balancing, resiliency,reliability, response time and manageability of communications networks.

In split-mount wireless radio systems, such as the Eclipse™ platformfrom Harris Stratex Networks, Inc., of Morrisville, N.C., the links areprovided via an outdoor unit (ODU). In such wireless radio platformimplementations, the nodes often include DACs to facilitatecommunications between them. Therefore, the design for achievingimproved performance may include modifying existing DACs.

To illustrate, FIG. 1 is block diagram of an existing DAC. As shown, aphysical link for delivering payload in a wireless network may include acarrier channel with physical media components such as a physical layerlink aggregation engine, a backbone interface, a modulator/demodulator,intermediate frequency (IF) interface, ODU and antenna. Therefore, thebuilding blocks in the DAC provide layer-2 switching capabilities,payload transport and configuration, monitoring and control functions.The Ethernet data streams payload received in the customer GigabitEthernet ports 101 is processed by a physical layer digital processingcomponent 102. A layer-2 switch 111 operates at the data-link layer (orlayer 2) of the Open Systems Interconnection (OSI) reference mode. Forforwarding Ethernet data streams from the physical digital processingcomponent 102, the switch 111 analyzes their source and destinationmedia access control (MAC) addresses and determines the output port overwhich the payload will be delivered (e.g., P0 . . . 3).

For the payload delivery, in addition to the above information, internaland external virtual LAN information, traffic priority, configuredthroughput and buffer capacity also play a role. Using such information,the switch 111 applies policing, scheduling and/or shaping algorithms todetermine path and priority that each packet should take and whether itshould be consumed, forwarded or dropped. To this end, the switch 111includes a shaper 112 in communicating relationship with a forwardingengine of the switch 111. The shaper functions to shape the data streamsbeing forwarded, including following the traffic rules in aligning thedata streams and scheduling the traffic. A shaper 112 may include queuesfor sorting message and a scheduler for computing release times.

The data link layer may be layer-2 of the OSI model or the TCP/IPreference model, and, as such, it responds to service requests from thenetwork layer (layer-3) and issues service requests to the physicallayer (layer-1). This is a layer that provides functional and proceduralmeans for data transfer between adjacent nodes and it may provide forerror detection and correction that may occur in the physical layer.Some data link protocols might include a handshake or reception andacceptance acknowledgment as well as checksum verification to increasereliability. The data link layer is split into media access control(MAC) and logical link control (LLC) sub-layers. For each physicaldevice type, the MAC sub-layer uses MAC addresses. In a LAN or othernetwork, the MAC address is a node's unique hardware identifier that acorrespondence table relates to the node's IP address; and on anEthernet LAN, it's the same as the node's Ethernet address.

To carry out packet processing functions, a DAC typically includes aprocessing engine 108, e.g., an FPGA, ASIC or CPLD-based processingengine. In particular, when packets are delivered to transport channelsTC1/TC2 through ports P6/P7, the processing engine 108 transforms thepackets into suitable blocks (with associated time slots). These blocksare carried by the backplane interface 110 and by the radio link(s) 60.Although the number of transport channels and the carrier time slots(with independent timing) is configurable in the DACs, existingimplementations use overhead information to resolve possible clockvariations among the carriers.

FIG. 2A illustrates the overhead used in a processing engine within aDAC in the prior art. In one instance, the processing engine is a fieldprogrammable gate array (FPGA)-based dual transport channel packetprocessing mechanism. The FPGA-based processing engine configuration canbe replaced with any suitable logic circuitry, however.

As shown, in the wireless transmit (TX) direction, when an Ethernetpacket arrives at TC1 or TC2 the overhead insertion module 202 in anFPGA-based processing engine 108 applies to it a high-level data linkcontrol (HDLC)-like encapsulation. A segmentation process is carried outby an inverse multiplexer 210 that divides the incoming frames into theconfigured number of segments and associates to them time slots andvirtual containers (links) that will be used for the transport(bandwidth allocation). The inserted overhead (encapsulation) allows forthe later synchronization of the multiple segments with time slots.These segments are transferred across the backplane interface to a radioaccess card (RAC) 35, 37 that will transmit them through a wirelesslink. A byte-synchronous idle fill is inserted 206 in the transportchannel stream when no payload is present.

In the wireless receive (RX) direction, the RAC will receive from theoutdoor unit (ODU) frames that contain the multiple segments via linkswith time slots that are being used to transport the Ethernet payload.These segments are transferred via the backplane interface 110 to theDAC. The multiplexer (MUX) 212 in the DAC, reassembles the originalEthernet packets from the multiple segments based on the time-to-dataindexing information from the memory 222. To guarantee the integrity ofthe packet, a byte synchronization stage is present. The aforementionedoverhead information is used to offset any clock differences that eachof the independent segments used for transporting might have,effectively aligning them back to the original packet layout. Any idlefill present in the transport channels is removed 208 so it neverreaches the layer-2 switch (item 111, FIG. 1). The encapsulation is thenremoved 204 and, using the TC1 and TC2 interfaces, the packet istransferred to the layer-2 switch.

FIG. 2B is a state diagram that shows the insert keep-alive packetsoperation. As shown, after a channel idle condition is detected thefailure detection algorithm transitions from steady state 402 to an idlestate 404. The packet fill continues while in the idle state 404 andbefore the keep-alive timer expires 406. When the payload is ready totransmit again, the algorithm transitions to the steady state 402.

Since keep-alive packets are only inserted when the channel is idle theamount of overhead due to such packets is minimal. The delay introducedby these packets is sufficiently small and almost undetectable becausethe size of these packets is so small. In the worst case scenario a newpacket ready and waiting to be transmitted will be delayed by theinsertion of only one keep-alive packet, assuming that the arrival ofthe new packet matches the expiration of the keep-alive insertion timerunder idle traffic conditions.

Among other things, the approach of using multiple physical links totransport data traffic between nodes is typically intended to achieveincreased link availability and bandwidth while avoiding loop formation.Thus, when a link aggregation group (LAG) is created, otherwiseindependent physical links are combined into a group to operate asmembers of a single virtual link (a single logical link). As mentioned,a DAC includes a plurality of ports, virtual containers (time slots),and link aggregation or trunking which involves logically grouping a setof ports and/or virtual containers so that two network nodes can beinterconnected using multiple links.

FIG. 3A illustrates the user interface of a physical layer linkaggregation (port) configuration program. As can be seen, the selectionof port aggregates can create various logical groupings of ports. Suchlogical grouping of ports increases link capacity and availabilitybetween network nodes.

Conventionally, link aggregation can be implemented at different levelsin the protocol hierarchy and depending on the OSI level, it will usedifferent information to establish which frames (or segments thereof)will be transported over the different links. A layer-2 link aggregationimplementation uses the MAC addresses of the source, destination orboth. A layer-3 implementation uses the corresponding IP addresses; andhigher layer implementations can use logical port information and otherlayer relevant information. And although either one of the layer-1,layer-2 or layer-3 solutions can be implemented, only one of thesesolutions can be deployed in a particular installation via softwareconfigurations (using, e.g., control code or other means to determinewhich approach is activated). Because devices can be deployed with allthree approaches, any one of these, layer-1, layer-2 or layer-3solutions, can be activated in the field.

Generally, however, load balancing is not optimized in conventionalinfrastructures because it is possible that all frames end up in onetransport channel or the other. Moreover, the distribution is dependenton features, e.g., MAC address, of the frames. Indeed, in the event of alink failure the whole link aggregation bundle will collapse and stopcarrying traffic. And, as layer-2 solutions do not fully addressresiliency and redundancy problems because they don't optimize loadbalancing, these problems may be better addressed with layer-1 linkaggregation.

Accordingly, in this instance, the resilient wireless physical layerlink aggregation (RWPLLA) is a layer-1 solution. Specifically, layer-1link aggregation is combined with the application of a rapid carrierfailure detection (RCFD) algorithm together with the necessaryhousekeeping functions in order to produce RWPLLA.

Inherently, the layer-1 solution has an additional benefit of unilateral(unidirectional) failure detection and faster reaction time to failures.Also, because the physical layer represents a true physical connectionit doesn't rely on higher-layer features (e.g., MAC/IP address featuresof frames) to deliver frames. Namely, the data transport is featurelessand, in turn, the layer-1 link aggregation is featureless. Additionally,the failure detection and physical layer link aggregation require lessoverhead then earlier solutions. Furthermore, some implementations canprovide featureless load balancing within the link aggregation bundleand carrier class redundancy among the participating carriers, as shownin FIG. 3B.

With layer-1 link aggregation each group has physical link (carrier)members, and, being featureless there is no need in this approach to usekeys associated with the members of each group. Moreover, a preferredRCFD and recovery is implemented as hardware-assisted RCFD and recoveryand it uses a per-link (or per-carrier) status approach rather then aglobal status approach. A carrier includes the physical media forcarrying data streams where a set of different data streams (a datacontainer) can be carried by the same physical media.

Note that connections, carriers, links, channels, and the like may referto logical connections, physical connection or both. In the context oflink aggregation these may be collectively referred to as “links” and alink aggregation group whose members are links, channels or carriers maybe often referred to as a “transport channel” or a “trunk.”

Based on the foregoing, in order to achieve improved performance, oneapproach modifies a data interface card such as the above-described DAC.Various embodiments of the modified DAC can be deployed in new as wellas existing wireless communication platforms such as the Eclipse™. Invarious exemplary embodiments we present a modified Gigabit Ethernetcard which we refer to as the “DAC-GE.”

The layer-1 link aggregation combined with the RCFD algorithm providesan improvement over layer-2 link aggregation; although both may includeprinciples on which the RCFD algorithm is based, as described in U.S.patent application Ser. No. 11/351,983, filed Feb. 10, 2006, which isincorporated herein by reference. The RCFD algorithm preferably employsindividual end-to-end status for each participating carrier in order todetect failures in individual carriers associated with a transportchannel on the DAC-GE. Although the failure detection can be done on aper-carrier basis, housekeeping and re-configuration may be donecollectively based on the individual carrier status results.

FIG. 4, illustrates a processing engine 109 in a DAC-GE (a modified DAC)41 designed to perform the foregoing functions (the embodiment shown hassome elements in common with the DAC of FIG. 2 with like designationnumbers). Note that other configurations of the processing engine arepossible although the preferred design employs a hardware-assistedimplementation in an FPGA, CPLD, ASIC-based processing engine or otherlogic circuitry (we refer to these implementations collectively as the“FPGA-based processing engine” or simply “processing engine”).

As implemented, the health of a carrier (physical link) is conveyed inan extended header to nodes on both sides of the link (e.g., at each endof the wireless communication link). Specifically, the processing engine109 in the DAC-GE 41 at each node keeps the extended header with the TXand RX status information. The RX status is computed based oninformation obtained from the traffic alignment indicator 714 as well asthe received packets and their integrity. The TX status is a reflectionof the far end node's RX status indicator that is conveyed in the headerof the received packets. In this design, a set of configurable registersallows adjustment of the system behavior to meet particular carrierclass specifications.

These registers are: keep-alive insertion rate, packet receive timeout,CRC (cyclic redundancy check) validation threshold and CRC errorthreshold. The keep-alive packet insertion rate register 704 representsthe rate in microseconds that the packet insertion engine will waitbefore inserting a keep-alive packet (under idle traffic conditions).The packet receive timeout register 710 represents the number ofmicroseconds that the receive engine will wait for a packet beforedeclaring an idle RX timeout. The CRC validation threshold register 711represents the number of consecutive good CRC packets that will have tobe received in order to change RX status from bad to good. The CRC errorthreshold register 709 represents the number of consecutive bad CRCpackets that will have to be received in order to change RX status fromgood to bad. The two configurable CRC registers provide a hysteresis toavoid bad-good status oscillations on a small number of errors.

Typically, the DAC encapsulation into an “HDLC like” packet structure ofEthernet frames received on TC1 or TC2 is used for synchronizationpurposes. However, for the purpose of achieving the improved performancewith RWPLLA and RCFD, a different packet structure is proposed with theaddition of a header field extension such that redundancy and statusinformation can be transferred without too much additional overhead. Theextra header field conveys RX status, and a CRC (checksum) guaranteesthe integrity of the header information.

FIG. 5 shows the proposed header field extension 501 and the CRC field503 alongside the payload field 298. The extended header field 501includes receive and transmit (TX, RX) status information.

The traffic alignment is intended for maintaining the integrity ofpackets that have been divided into segments and need to bere-constructed properly. As shown in FIG. 6, for instance, the bitstream of a packet with is segmented with a first byte (‘5’) going to afirst container, a second byte (‘10’) going to a second container, andso on. With four containers in this example, the fifth byte (‘78’) alsogoes to the first container and the first byte is pushed to the right.

FIG. 7, illustrates decomposition into segments and re-composition ofdata streams as implemented in a node with a dual channel configuration.With such configuration, a node may include a dual channel DAC-GEinterfaced via a TDM bus with a pair of radio access cards (RAC1 andRAC2). The TX/RX carriers, TC1 and TC2, receive/transmit Ethernet framesto/from the processing engine 108 in the DAC-GE. When receiving anoutgoing data stream (TX data stream) the inverse multiplexer 601disassembles the TX data stream into four segments, creating a containerof four data streams (1 a, 2 a, 3 a, 4 a). The TDM bus 603 transportsthe disassembled TX (four data streams) with two of the four datastreams going to the first RAC (RAC1) and the other two going to thesecond RAC (RAC2). In each of the RACs, a respective multiplexer 604,606assembles an air frame from an assembly of the two data streams (1 a,2 aand 3 a,4 a, respectively). A modulator 608 and 610 in each RACmodulates the respective air frame and the modulated air frames(wireless packet) is sent to the respective ODU1 and ODU2, for wirelesstransmission. That is, in a dual channel configurations the TX datastream is sent in two parts, one part (segments 1 a,2 a) through RAC1and a second part (segments 3 a,4 a) through RAC2.

For incoming (RX) data streams, the ODUs receive separate parts of thewireless packets and respective demodulators 609,611 demodulate them torecreate the air frames. The demodulated air frames are eachdisassembled by the corresponding inverse multiplexers 605, 607 into twosegments 1 b,2 b, and 3 b,4 b, respectively. These segments are passedvia the TDM bus 603 to the DAC-GE for re-assembly by the multiplexer602.

Existing techniques for reassembling the original TX data streamsrequire that all parts of the transmitted data stream be present andaligned for proper reassembly of the original TX data stream (i.e., toallow proper reassembly of the Ethernet frame). The incoming datastreams are ‘featureless’ in that they do not have any layer-2attributes such as MAC addresses. Thus, if one of the physical linksfails the system may loose all the payloads associate with such linkbecause there is no way to quickly know which link failed. A physicallink failure would prevent reconstruction of data streams and with suchloss of data it would render the communication system deficient or eveninoperable.

However, with a modified DAC such as the DAC-GE with thehardware-assisted FPGA-based physical layer link aggregation engine,when a physical link failure occurs such engine can re-direct the datastreams to the remaining links (remaining members of the linkaggregation group). An RCFD managed by such physical layer linkaggregation engine is based on an end-to-end, per-link status monitoringand results in minimal disruption of communications. Thishardware-assisted, quick failure detection of individual links mayincrease the load on the remaining operable links for a while but itwill operate to preserve connectivity between nodes and allow continuedreception of substantially all transmitted data.

As noted before, the approach of using multiple physical links totransport data traffic between nodes is typically intended to achieveincreased link availability and bandwidth while avoiding loop formation(e.g., the ability to operate at twice the speed when using two radiolinks). However, the detection and the switching in an existing systemwould commonly be made within 100 ms; and failure recovery could takeseconds using a standard messaging approach. Thus, to achieve or exceedcarrier class Ethernet transport channel standards the link aggregationdepends on fast failure detection and recovery.

Advantageously, a RWPLLA in combination with a hardware-assisted RCFDalgorithm allows failure response and recovery within hundreds ofmicroseconds as compared to the standard approach that would normallytake up to seconds. The redundancy characteristics of a LAG incombination with the rapid channel failure detection algorithm operateto redirect the traffic among the remaining reliable physical links. Theswitching and queuing of the packets is reorganized by a linkaggregation control task residing in the shaping engine of a layer-2switch. Therefore, the physical layer link aggregation engine in theDAC-GE preferably includes an RCFD engine and the aforementioned layer-2switch and shaping engine. More details on such engine and on failuredetection and recovery will be provided below.

First, however, FIG. 8 illustrates deployment of a modified DAC in awireless communications network, such as a network based on theaforementioned Eclipse™ platform. The illustrated Eclipse™ wirelesscommunication system includes two nodes, each with a split-mountconfiguration that includes an intelligent node unit (INU) 30, 31operatively interfaced with dual ODUs 45,47 and 46,48, respectively. TheINU includes the DAC-GE and RAC1 and RAC2 (not shown) for effecting thecommunications of data streams between the nodes as described above. TheEthernet data streams are conveyed via Ethernet connections 101 betweeneach INU and external data equipment 27,29. Advantageously, theillustrated wireless communication system is configurable for linkaggregation where the wireless data traffic uses two radio paths 60 and62 between the two nodes.

It is worth noting that the RCFD algorithm is resilient to errorpropagation and eliminates unnecessary switchover. Because of the fastdetection of a link failure or fading conditions the wirelesscommunication system will rapidly switch to a single link (60 or 62).

Additionally, taking advantage of the per-link, unidirectional failuredetection capabilities of the RCFD algorithm, a system with physicallayer link aggregation could have an asymmetric behavior by having thefull link throughput available in one direction while using only alimited throughput (due to unidirectional link failure) in the other.This is the case of video-broadcasting systems or other applicationsthat heavily use broadcast or multicast transmission or that areasymmetric in nature.

In the next example, as shown in FIG. 9, the wireless communicationsystem included at least three nodes. The DAC-GE 41,43 is deployed inthe INU of at least two of the nodes 30,31,32. The DAC-GE includesfunctionality that enhances failure detection and recovery withoutcompromising throughput, providing, for instance, below-50 ms failureresponse time. The DAC-GE interfaces with a customer data system 27, 29on one side and with the radio access cards (RACs) 33, 35, 37, 39 on theother. The data from each RAC flows to a respective one of the ODUs(e.g., 45, 47, 49, 51; in a split mount system such as the Eclipse™) andthrough the wireless link 60, 62, 64, 66. As before, when a linkaggregation group (LAG) is created, otherwise independent physical links60,62, or 64,66, are respectively combined into a LAG to operate asmembers of a single virtual link (a single logical link).

Note that there could be multiple hops between nodes 30 and 32.Nevertheless, the failure detection and recovery operations of theDAC-GE are indifferent to the number of hops and they beneficiallyfacilitate network end-to-end failure detection and recovery.

Moreover, while failure detection and recovery routing and switching canoccur at the data link layer (layer-2) or a higher layer of the OSImodel, preferably, failure detection operations are performed at thephysical layer (layer-1 via the RCFD) and recovery operations areperformed at the data link layer (via the layer-2 switch and shaper).While the data link layer is responsible for the integrity of eachsegment in the ring, the physical layer is better for implementing afaster mechanism for monitoring the integrity of the physical channelsand detects any failures from end to end of the network. For instance,the physical layer can quickly detect absence of incoming data streamsonce a predetermined time threshold is reached and redefine the topologyof the system (learning MAC addresses of alternate ports). This is notthe same but is somewhat akin to the rapid spanning tree protocol.

To further illustrate the foregoing, the block diagram in FIG. 10illustrates the interface between a DAC-GE and two separate RACs toallow the interface to dual ODUs 45,47 from a single DAC-GE 41. In theINU, the TDM bus 110 provides the backbone through which various cardssuch as the node control card (NCC) 21, DAC-GE 41 and RACs 33,35 areconnected. The NCC includes a processor 115 and functions as a busmaster controlling access by the various cards including the DAC-GE card41. Through the customer interface ports (Gigabit Ethernet ports) 101,the DAC-GE communicates with customer data systems, and the RACs 33,35interfaces between the DAC-GE 41 and the wireless front-end, the ODU 45and antenna 23.

As further shown, an FPGA 109 resides in the DAC-GE card 41 and itsfunctionality is provided to facilitate the physical layer linkaggregation, detection of carrier failures and redistribution of trafficamong the remaining available carriers. The CPU 115 in the node controlcard (NCC) 21 performs a monitoring function that will reconfigure theswitch 111 to the new capacity of the remaining available carriers. Thetraffic is distributed via the switch in the DAC-GE card but the CPU inthe NCC card does the reconfiguration. In other words, the switch on theDAC-GE card is dynamically reconfigured under control of the CPU in theNCC card based on operation (failure detection etc.) of the FPGA.

Each transport channel has more than one virtual container's worth ofcapacity allocated to it (by reason of the logically grouped links). Inthe present example, each container can use an independent link (such asradio link) to transport the payload and the capacity of each transportchannel can be 2×155 Mbps containers. In this case, because the linkaggregation is made at the physical level, no particular information isused in the distribution of the frames over the different links andthere is no intervention form the layer-2 switch. The layer-2 switchactually is not aware of the fact that the payload is split into twodifferent links. The information available to a layer-2 switch islimited to the transport channel capacity according to which the switchwill shape the traffic payload (i.e., transmission rate).

For load balancing, frames provided to the FPGA at the transmit (TX) endare each split (segmented), preferably uniformly, or alternatively,based on capacity or speed of the transport channels. The segmentationcan be done on a byte, word, packet or other suitable boundary, so longas the TX and RX ends are aligned (both RX and TX are configured for thesame boundaries so that the frames are well bounded in all cases). Whileat the TX end the frames are segmented, at the receive end the framesegments are reassembled (with proper alignment, e.g., as shown in FIG.7B) to produce the original frames.

In one implementation, both ends, TX and RX, handle one frame at a time,exclusively. In such serial operation, one or more iterations may beperformed. Namely, transporting all the segments may require more thanone iteration when the number of segments is larger than the number ofcarriers, as each segment is assigned to a carrier. In anotherembodiment, more than one frame is transported simultaneously. In suchparallel operation, the segments of multiple frames can be processedsimultaneously by allocating to each of them a subset of carriers fromamong the total pool of carriers.

Frames segmentation, reassembly and the ability to reorganize them inthe event of failure facilitate the desired resilience. With suchresilience, if any carrier fails, the remaining channels can be used totransport the frames (i.e. payload traffic can continue using theremaining capacity).

Preferably, the FPGA used to implement a featureless link aggregation isdesigned to apply extended failure detection. In particular, the failuredetection is extended from an application of the RCFD to all thecarriers at once (i.e., the entire transport channel) to a per-carrierapplication of the RCFD algorithm. With a per-carrier RCFD, individualcarrier failures can be detected and isolated, and then, when carriersrecover, they can be individually brought back online. Failures can beestablished using a carrier status appended to frames. The respectivestatus determinations for a per-carrier approach and for an entiretransport channel (all-or-nothing) approach have common failuredetection steps. However, in a per-carrier approach, once the status ofeach individual carrier is determined, the status determination for theentire transport channel can be derived by combining the individualcarrier status values through an OR calculation or other suitableoperation. Consequently, only if all the carriers have failed the statusof the entire transport channels becomes ‘bad’ otherwise it stays‘good’. This is unlike the ‘all-or-nothing’ approach where if one of thecarriers fails the entire transport channel becomes ‘bad’ and the entirephysical layer link aggregation collapses and stops delivering framestraffic.

FIG. 11 is a state diagram illustrating RCFD link failure andrestoration executed by a DAC-GE detecting a link failure in one of theactive ports of the network topology. Additionally, the state diagramalso shows the steps executed when a failed link is restored. It isimportant to mention that in some networks the original topology willnot be restored after the detection of a link restoration. As shown,when application of the RCFD on a per-carrier basis uncovers failure ofone or more carriers, a state transition 1 from steady state operations910 involves marking the associated data structures as ‘unusable’ (theirstatus is ‘bad’) 920. Consequently, the payload traffic is redistributedamong the remaining carriers 922 and the shaper (switch component)adjusts the frame transmission rate to the remaining capacity based onthe reduced traffic capacity 924. When the per-carrier application ofthe RCFD uncovers carrier recovery, a state transition 2 involvesmarking the associated data structures as ‘available’ (their status is‘good’) 930. Consequently, the payload traffic can be redistributedamong the increased number of carriers 932 and the shaper increases theframe transmission rate based on the increased traffic capacity 934.

In some embodiments, one of the requirements for the failure detectionalgorithm is to be independent from the presence of payload traffic inthe channel. To be able to meet such a requirement, the algorithm isdesigned to detect the absence of payload traffic (idle) and insertkeep-alive packets that will maintain the link status. The format of akeep-alive packet is basically the same as a normal payload packetformat but without the payload segment and it conveys the same statusand integrity information.

In addressing resiliency under various traffic conditions, a DAC-GEdesign for RWPLLA includes implementation of the aforementioned RCFDalgorithm for detecting failures in individual carriers. The design ofthe RCFD algorithm includes a number of possible considerations, somemore important than others. One such design consideration is backwardscompatibility with existing Gigabit Ethernet card frameworks. It is alsodesirable to design the algorithm to be resilient to noise and smallerror bursts. For instance, if an uncorrectable frame is sent out by theradio link the transport channel status should not be changed, i.e.,single packet errors should not trigger a status change.

Also, it is preferable to make the rapid channel failure detectionalgorithm an end-to-end solution. That is, the algorithm should beagnostic to the number of hops required by the transport channel to getthe payload across the radio link (presence of repeaters). Moreover, therapid channel failure detection algorithm should be able to resolvefailures in either direction independently (i.e., unidirectionalfailures).

Radio link fades and outages occur due to natural conditions and theyare typically bidirectional, but hardware failures may not be. Thefailure of a power amplifier, or transmit (TX) or receive (RX)synthesizer, for example, would cause a unidirectional failure. Thealgorithm should be capable of detecting and indicating independentlywhen the failure occurred and whether it took place in the transmit orreceive direction. Some applications may benefit from the possibility ofhaving unidirectional traffic still going through. Link aggregation forexample may benefit from having two channels transmitting in onedirection and only one coming back.

Moreover, the rapid channel failure detection algorithm is preferablyautonomous in the detection of a failure in that it does not depend onother alarms or signals available in the system to determine thefailure. Such algorithm is also independent from the presence of payloadtraffic.

In addition to being autonomous, the rapid channel failure detectionalgorithm is preferably designed to automatically recover from afailure. For instance, if the protocol used to implement the failuredetection remains in operation (attempting to re-establish communicationwith the far-end) after a failure takes place, it will be able torecover automatically when the link is restored.

Apart from the foregoing, one typical design requirement is fast(preferably below 50 ms) failure detection capability. To this end, theconfiguration and management processor is preferably not involved in therapid channel failure detection algorithm and it does not use the out ofband network management system (NMS) overhead channel present in thelink to convey decision information or status. Additionally, thealgorithm is designed to perform its functions with the least amount ofbandwidth (overhead) possible. Again, this protocol is preferablyembodied as a hardware-assisted protocol implementation. Ethernet frameencapsulation is therefore designed to accommodate these requirements.Specifically, the addition of a header field extension allows redundancyand status information to be transferred without too much additionaloverhead. The extra header field conveys RX and TX status informationand provides integrity check of the header information.

As to the status, FIG. 12 is a block diagram of a carrier link portionof the FPGA (field programmable gate array) in a DAC-GE. In thisembodiment, a carrier link status packet (CLSP) 730 is a small packetthat is inserted into the Ethernet frame at regular intervals and usesthe stuffing rules of HDLC-like packet structure to avoid interferingwith the true payload. The CLSP insertion intervals are dependent on theCLSP insertion rate 717 so that the RCFD algorithm may be independentfrom the presence of payload traffic in the carrier channel. Theinsertion occurs in the presence of absence of payload traffic, and aCLSP appear as a special signature within a frame that can be easilydetected at the far end of a link. Accordingly, carrier TX and RX statusinformation for each end of link is kept in the DAC_GE by the FPGA. TheRX status is computed based on information obtained from the CLSPpackets and their integrity (e.g., checksum). The carrier TX status is areflection of a far-end carrier RX status indicator conveyed in theCLSPs. The status of an entire transport channel is the status sum ofall carrier channels. As further shown, in this embodiment for eachcarrier channel (virtual container) there is a set of configurableregisters for adjusting the behavior of the system to meet carrier classspecifications. These registers include a carrier link status packetinsertion rate register 717, an integrity validation threshold register725 and an integrity error threshold register 726.

In addition to being independent of the presence or absence of payloadtraffic, RCFD algorithm is may discover unidirectional link failures inthat TX failure detection is independent of RX failure detection. FIG.13 is a flow diagram illustrating the preferred failure detecting andrecovery algorithm. This diagram shows RCFD algorithm including the TXand RX status updates and recovery conditions.

Initially, a default value of the status indicates RX and TX statusbeing bad 1002. Subsequently, a number of conditions may be used todetect an error, which either perpetuates a bad status or converts agood status to bad. Examples of such conditions are packet receivedtimeout and integrity error threshold exceeded. In the receivedirection, wirelessly transmitted frames are expected to arrive at a RAC1004. If the time interval in which frames are absent 1010 exceeds apredetermine frame receive threshold which means that it reaches packetreceived timeout condition 1012, the RX status is set to ‘bad’ and theintegrity status is set to ‘OK’ 1006. The packet received timeoutcondition indicates that there has been an unexpectedly long period oftime during which no packets have been received. However, if frames arereceived timely 1004, such frames may contain multiple packet segmentswith associated time slots that are used in connection with transportingthe payload.

Although not shown here, one way to improve the integrity of the packetsis through byte synchronization that uses the overhead information tooffset time differences that each of the independent links use fortransporting payload effectively aligning the packets to their originallayout. If this alignment fails, a traffic alignment error can be usedas an alarm indicating that the local receiver has not yet synchronizedwith the far end transmitter.

Another or an additional way to improve the integrity of the packets isto compute the integrity value, e.g., CRC, checksum or other, and tocompare it with a known integrity value (1014 and 1016). If the computedintegrity value doesn't match the known integrity value, there is anintegrity error and the integrity error counter is incremented 1018. Ifsuch integrity error counter exceeds the integrity error threshold 1020,such condition indicates that the last n consecutive packets receivedhad an integrity error and that, therefore, the channel is not reliable.In this case, n is a configurable parameter that will change accordingto the transport channel capacity. If the integrity value is correct (amatch is found) 1016, the integrity error counter is reset (set=0), theintegrity ‘OK’ counter is incremented and TX status is set to match thepacket status 1022. However, before declaring a link's status as good,the number of consecutive packets with correct integrity (i.e., theintegrity ‘OK’ counter) needs to exceed the integrity ‘OK’ thresholdvalue. The number of consecutive packets used to declare a carrier linkstatus as good is usually smaller than the number of consecutive badpackets used to declare a carrier link status as bad. This preventsoscillation and provides a good confidence level for the transition totake place. Having such threshold as a configurable parameter, allowsthe system administrator to choose the confidence level he wants for agood link status. Accordingly, if the integrity ‘OK’ counter exceeds theintegrity ‘OK’ threshold 1024, the RX status is deemed ‘good’ 1026 or isconverted to ‘good’ if it was initially ‘bad’. Otherwise it either stays‘bad’ if it was initially ‘bad’ or it is converted to ‘bad’ if it wasinitially ‘good.’ Additional frames are expected and the cycle repeats(at point ‘1’) for each of them, except that the status may be initially‘good’ or ‘bad’ based on the history of previous frames.

Any of the foregoing timeout or error conditions described above mayindicate a bad receive (RX) status and all of them will have to beabsent in order to declare a good RX status. The RX status (good or bad)will be added to all packet headers associated with it's transportchannel, notifying the far end node in this way of the current receiveconditions. The TX status (set on step 1022) therefore is a reflectionof the far end node RX status as reported over packets with goodintegrity. The far end RX status contained in bad packets shall beignored.

In order to meet carrier class failure detection expectations, theconfigurable threshold and parameters of the failure detection algorithmcan be adjusted according to the different capacities allocated to thetransport channel. For instance, the number of successive packets inerror can be adjusted to filter out error bursts and provide aconfidence level for the error detection. The keep-alive packetinsertion rate can also be tuned depending on the expected traffic loadto achieve better response time. For a high utilization percentage theuse of keep-alive messages will have a low probability of occurrence,whereas in low utilization percentages these messages will be insertedon regular basis.

Of course, it is beneficial and preferred that once a failure isdetected the algorithm continues to work. To that end, the insertion ofkeep-alive messages and CLSPs to recover the link status needs to bemaintained even if the payload traffic has stopped to flow in theaffected transport channel. These keep-alive messages will carry all theinformation required to recover to a good link status once theimpairment that caused the failure is removed.

In sum, although various embodiments have been described in considerabledetail, other versions and applications of the resilient physical layerlink aggregation combined with the rapid transport failure detectionalgorithm and DAC-GE are possible. Therefore, the spirit and scope ofthe appended claims should not be limited to the description of thepreferred versions contained herein.

1. (canceled)
 2. A method of providing resilient data communications,comprising: using a physical-layer link-aggregation circuit at aphysical layer of a network to aggregate wireless links in the networkto generate a virtual channel for data communications; receiving a groupof one or more data frames for transmission over the virtual channel;segmenting the group of one or more data frames to generate data framegroup segments; transmitting each of the data frame group segmentsacross a selected one of the wireless links of the virtual channel;detecting, by a failure detection circuit at the physical layer, a linkfailure of a particular wireless link of the virtual channel; andautomatically redistributing the data frame group segments away from theparticular wireless link to at least one other wireless link of thevirtual channel after the detecting of the link failure of theparticular wireless link to render data communications through thevirtual channel resilient to the link failure of the particular wirelesslink.
 3. The method of claim 2, further comprising assigning a ‘good’status condition for the virtual channel, and maintaining the ‘good’status condition for the virtual channel unless all of the wirelesslinks of the virtual channel fail.
 4. The method of claim 2, furthercomprising: monitoring for a recovery of the particular wireless linkfrom the link failure; and automatically redistributing data frame groupsegments to the particular wireless link after detecting the recovery ofthe particular wireless link.
 5. The method of claim 2, wherein a dataaccess card performs the steps of using the physical-layerlink-aggregation circuit to aggregate the wireless links and ofautomatically redistributing the data frame group segments by managingports associated with the data access card.
 6. The method of claim 2,wherein the step of detecting, by the failure detection circuit at thephysical layer, the link failure includes monitoring for a failure in atleast one of traffic alignment, packet delay, or packet integrity. 7.The method of claim 2, wherein: each wireless link of the virtualchannel communicates the data frame group segments between at least afirst node and a second node; the at least the first and second nodeshave an associated transmit status and an associated receive status, thetransmit status associated with the first node being a reflection of thereceive status associated with the second node; and the step ofdetecting, by the failure detection circuit at the physical layer, thelink failure includes detecting a failure in at least one of thetransmit status or the receive status.
 8. The method of claim 7, furthercomprising formatting packets at the first node with an extended headerfield that contains the receive status associated with the first node, acyclic redundancy checksum (CRC), and the transmit status associatedwith the first node.
 9. The method of claim 7, further comprising:determining at the second node whether each of the packets from thefirst node has valid integrity; and determining a ‘good’ transmit statusor a ‘good’ receive status by detecting that a predetermined number ofsuccessive packets have valid integrity.
 10. The method of claim 2,wherein the segmenting the group of one or more data frames includessegmenting the group of one or more data frames to a segment size basedon one or more link capacities or link speeds of the wireless links ofthe virtual channel.
 11. The method of claim 2, wherein the segmentingthe group of one or more data frames includes segmenting the group ofone or more data frames to a uniform segment size.
 12. A system forproviding resilient data communications, comprising: a physical-layerlink-aggregation system at a physical layer of a network configured toaggregate wireless links in the network to generate a virtual channelfor data communications; a port configured to receive a group of one ormore data frames for transmission over the virtual channel; an inversemultiplexing circuit configured to segment the group of one or more dataframes to generate data frame group segments for transmissionrespectively across the wireless links of the virtual channel; atransmitter configured to transmit each of the data frame group segmentsacross a selected one of the wireless links of the virtual channel; afailure detection circuit configured to detect, at the physical layer, alink failure of a particular wireless link of the virtual channel; and aredistribution mechanism in communication with the failure detectioncircuit and configured to automatically redistribute the data framegroup segments away from the particular wireless link to at least oneother wireless link of the virtual channel after the detecting of thelink failure of the particular wireless link to render datacommunications through the virtual channel resilient to the link failureof the particular wireless link.
 13. The system of claim 12, furthercomprising a virtual channel manager for assigning a ‘good’ statuscondition for the virtual channel, and maintaining the ‘good’ statuscondition for the virtual channel unless all of the wireless links ofthe virtual channel fail.
 14. The system of claim 12, further comprisinga recovery manager configured to monitor for a recovery of theparticular wireless link from the link failure, and to automaticallyredistribute data frame group segments to the particular wireless linkafter detecting the recovery of the particular wireless link.
 15. Thesystem of claim 12, further comprising a data access card that managesports associated with the data access card.
 16. The system of claim 12,wherein the failure detection circuit monitors, at the physical layer,for a failure in at least one of traffic alignment, packet delay, orpacket integrity.
 17. The system of claim 12, wherein: each wirelesslink of the virtual channel communicates the data frame group segmentsbetween at least a first node and a second node; the at least the firstand second nodes have an associated transmit status and an associatedreceive status, the transmit status associated with the first node beinga reflection of the receive status associated with the second node; andthe failure detection circuit detects, at the physical layer, a failurein at least one of the transmit status or the receive status.
 18. Thesystem of claim 17, wherein the first node formats packets with anextended header field that contains the receive status associated withthe first node, a cyclic redundancy checksum (CRC), and the transmitstatus associated with the first node.
 19. The system of claim 18,wherein: the second node includes the failure detection circuit; and thefailure detection circuit determines whether each of the packets fromthe first node has valid integrity, and determines a ‘good’ transmitstatus or a ‘good’ receive status by detecting that a predeterminednumber of successive packets have valid integrity.
 20. The system ofclaim 12, further comprising a load balancer configured to segment thegroup of one or more data frames to a data frame group segment sizebased on one or more link capacities or link speeds of the wirelesslinks of the virtual channel.
 21. The system of claim 12, furthercomprising a load balancer configured to segment the group of one ormore data frames to a uniform segment size.
 22. A method of providingresilient data communications, comprising: using a physical-layerlink-aggregation circuit at a physical layer of a network to aggregatewireless links between a first node and a second node to generate avirtual channel for data communications; receiving by the first node agroup of air frames over a group of the wireless links of the virtualchannel, the group of air frames being sent by the second node;processing by the first node the group of air frames to generate dataframe group segments; assembling by the first node the data frame groupsegments to generate a group of one or more data frames; examining bythe first node at the physical layer of the network the group of one ormore data frames to detect a wireless link status packet for determininga status of a particular wireless link of the wireless links of thevirtual channel, the wireless link status packet having been insertedinto the group of one or more data frames by the second node; andstoring by the first node a flag to identify the particular wirelesslink as good or bad based on the examination, the first node using theflag to identify a link failure of the particular wireless link of thevirtual channel.
 23. A system of providing resilient datacommunications, comprising: a physical-layer link-aggregation circuit ata physical layer of a network configured to aggregate wireless linksbetween a first node and a second node to generate a virtual channel fordata communications; a demodulator configured to receive a group of airframes over a group of the wireless links of the virtual channel, thegroup of air frames being sent by the second node; a demultiplexerconfigured to generate data frame group segments from the group of airframes; a multiplexer configured to assemble the data frame groupsegments to generate a group of one or more data frames; a packetdetection circuit at the physical layer of the network configured toexamine the group of one or more data frames to detect a wireless linkstatus packet for determining a status of a particular wireless link ofthe wireless links of the virtual channel, the wireless link statuspacket having been inserted into the group of one or more data frames bythe second node; and a register configured to store a flag to identifythe particular wireless link as good or bad based on the examination,the first node using the flag to identify a link failure of theparticular wireless link of the virtual channel.